Generalized weights of convolutional codes
نویسندگان
چکیده
In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a code as an infinite dimensional linear endowed with the metric. this paper, we propose new definition of that takes into account underlying module structure code. We derive basic properties our discuss relation previous definition. establish upper bounds on weight hierarchy MDS MDP codes show that, depending parameters, some or all are determined length, rank, internal degree also prove anticode bound define optimal anticodes which meet bound. Finally, classify compute their hierarchy.
منابع مشابه
On the generalized Hamming weights of convolutional codes
Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...
متن کاملOn the Generalized Hamming Weights of Convolutional
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hamming weight for a linear block code. In this paper we deene generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to derive upp...
متن کاملRelative generalized Hamming weights of cyclic codes
Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...
متن کاملGeneralized threshold decoding of convolutional codes
It is shown that any rate lib systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow "decoding" of a received sequence in its unquantized analog form.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3267091